Fast inversion algorithms for a class of structured operator matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative inversion of structured matrices

Iterative processes for the inversion of structured matrices can be further improved by using a technique for compression and refinement via the least-squares computation. We review such processes and elaborate upon incorporation of this technique into the known frameworks.

متن کامل

Fast algorithms for positive definite matrices structured by orthogonal polynomials

Positive definite matrices structured by orthogonal polynomial systems allow a Cholesky type decomposition of their inverse matrices in O(n2) steps. The algorithm presented in this paper uses the three-term recursion coefficients and the mixed moments of the involved polynomials.

متن کامل

TR-2002014: Iterative Inversion of Structured Matrices

Iterative processes for the inversion of structured matrices can be further improved by using a technique for compression and refinement via the least-squares computation. We review such processes and elaborate upon incorporation of this technique into the known frameworks.

متن کامل

Fast Algorithms for Structured Sparsity

Sparsity has become an important tool in many mathematical sciences such as statistics, machine learning, and signal processing. While sparsity is a good model for data in many applications, data often has additional structure that goes beyond the notion of “standard” sparsity. In many cases, we can represent this additional information in a structured sparsity model. Recent research has shown ...

متن کامل

Fast inversion of Chebyshev { Vandermonde matrices 1

This paper contains two fast algorithms for inversion of ChebyshevvVander-monde matrices of the rst and second kind. They are based on special representations of the Bezoutians of Chebyshev polynomials of both kinds. The paper also contains the results of numerical experiments which show that the algorithms proposed here are not only much faster, but also more stable than other algorithms avail...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2003

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(03)00475-0